منابع مشابه
Homogeneous bipartition based on multidimensional ranking
We present an algorithm which partitions a data set in two parts with equal size and experimentally nearly the same distribution measured through the likelihood of a Parzen kernel density estimator. The generation of the partition takes O( 1 2 N(N − 1)) operations (N number of data) and is 2 orders of magnitude faster than the state of the art. 1 Generating an equi-distributed bipartition 1.1 P...
متن کاملChain-constrained spanning trees
We consider the problem of finding a spanning tree satisfying a family of additional constraints. Several settings have been considered previously, the most famous being the problem of finding a spanning tree with degree constraints. Since the problem is hard, the goal is typically to find a spanning tree that violates the constraints as little as possible. Iterative rounding has become the too...
متن کاملDegree-constrained spanning trees
S of the Ghent Graph Theory Workshop on Longest Paths and Longest Cycles Kathie Cameron Degree-constrained spanning trees 2 Jan Goedgebeur Finding minimal obstructions to graph coloring 3 Jochen Harant On longest cycles in essentially 4-connected planar graphs 3 Frantǐsek Kardoš Barnette was right: not only fullerene graphs are Hamiltonian 4 Gyula Y. Katona Complexity questions for minimally t-...
متن کاملLexicographical ordering by spectral moments of trees with a given bipartition
Lexicographic ordering by spectral moments ($S$-order) among all trees is discussed in this paper. For two given positive integers $p$ and $q$ with $pleqslant q$, we denote $mathscr{T}_n^{p, q}={T: T$ is a tree of order $n$ with a $(p, q)$-bipartition}. Furthermore, the last four trees, in the $S$-order, among $mathscr{T}_n^{p, q},(4leqslant pleqslant q)$ are characterized.
متن کاملDistance Constrained Labelings of Trees
An H(p, q)-labeling of a graph G is a vertex mapping f : VG → VH such that the distance (in the graph H) of f(u) and f(v) is at least p (at least q) if the vertices u and v are adjacent in G (are at distance two in G, respectively). This notion generalizes the notions of L(p, q)and C(p, q)-labelings of graphs studied as a graph model of the Frequency Assignment Problem. We study the computation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2016
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2016.10.003